GRAPH-DIRECTED FRACTAL IMAGE COMPRESSION

نویسندگان

چکیده

Fractal image compression is a method to compress images, which significantly reduces the storage keep data of using partial iterated function systems. In this work, we generalize classical fractal graph-directed case.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Image Fractal Compression with Graph-Based Image Segmentation Algorithm

In this paper, the basic theory of image fractal compression is briefly introduced; some typical fractal compression approaches are discussed. Based on this discussion, according to the problem of long encoding time which exists in the typical fractal compression approaches, we propose a fast image fractal compression approach based on the combination of adaptive quad tree compression approach ...

متن کامل

Fractal image compression

The top-selling multimedia encyclopedia Encarta, published by Microsoft Corporation, includes on one CD-ROM seven thousand color photographs which may be viewed interactively on a computer screen. The images are diverse; they are of buildings, musical instruments, people’s faces, baseball bats, ferns, etc. What most users do not know is that all of these photographs are based on fractals and th...

متن کامل

Fractal Image Compression

Standard graphics systems encode pictures by assigning an address and colour attribute for each point of the object resulting in a long list of addresses and attributes. Fractal geometry enables a newer class of geometrical shapes to be used to encode whole objects, thus image compression is achieved. Compression ratios of 10,000:1 have been claimed by researchers in this field. The fractal equ...

متن کامل

Fractal Image Compression

The first fully automated fractal image compression algorithm was published by Arnaud Jacquin in 1989. Given an image f , the encoder finds a contractive affine image transformation (fractal transform) T such that the fixed point of T is close to f . The decoding is by iteration of the fractal transform starting from an arbitrary image. Due to the contraction mapping principle, the sequence of ...

متن کامل

Evolutionary fractal image compression

This paper introduces evolutionary computing to fractal image compression. In fractal image compression [1] a partitioning of the image into ranges is required. We propose to use evolutionary computing to find good partitionings. Here ranges are connected sets of small square image blocks. Populations consist of Np configurations, each of which is a partitioning with a fractal code. In the evol...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Eskis?ehir teknik u?niversitesi bilim ve teknoloji dergisi b- teorik bilimler

سال: 2022

ISSN: ['2667-419X']

DOI: https://doi.org/10.20290/estubtdb.988203